Polling with batch service

Dynamic visit-order rules for batch-service polling

A Polling Model with Retrial Customers

A polling model with n stations and switchover times is considered. The customers are of n different types, arrive to the system according to the Poisson distribution in batches of random size, and if they find the server unavailable, they start to make retrials until succeed to find a position for service. Each batch may contain customers of different types while the numbers of customers belon...

Approximation of discrete-time polling systems via structured Markov chains

We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routi...

Time-limited polling systems with batch arrivals and phase-type service times

In this paper, we develop a general framework to analyze polling systems with either the autonomous-server or the time-limited service discipline. According to the autonomous-server discipline, the server continues servicing a queue for a certain period of time. According to the time-limited service discipline, the server continues servicing a queue for a certain period of time or until the que...

Analysis of Manufacturing Systems

1. fntroduction We consider poliing systems where service is given in batches of unlimited size. When the server visits a queue, all customers present are served in a single batch. We call tlis gated batch seruice. The batch service time is independent of the size of the batch. Some examples of such systems are discussed in the literature below. Examples more related to manufacturing are ovens,...